The Bits Between The Lambdas : Binary Data in a Lazy Functional

For the programmer, storage media are usually assumed to have a minimum atomic unit of transfer of one byte. However , sometimes it is useful to have an even ner storage granularity of one bit, for instance in order to compress data. This paper describes an API in the lazy functional language Haskell for treating storage media as arbitrary-length streams of bits, without byte-alignment constraints. So far as possible, storage media are treated uniformly. In particular , bit-stream memory and binary les share the same API { a new and useful abstraction over memory management and le management. This uniformity of access leads to a novel technique for lazy random-access to les in a purely functional manner. We also describe a technique for automatically deriving compressed binary representations of user-deened data structures, whose operations provide both in-heap data compression and convenient high-level binary I/O. Of many possible applications, we illustrate the processing of Huuman-encoded image data, and a bibliographic information system which uses lazy B-Trees for eecient storage management.